A Polynomial Invariant and Duality for Triangulations

نویسندگان

  • Vyacheslav Krushkal
  • David Renardy
چکیده

The Tutte polynomial TG(X,Y ) of a graph G is a classical invariant, important in combinatorics and statistical mechanics. An essential feature of the Tutte polynomial is the duality for planar graphs G, TG(X,Y ) = TG∗(Y,X) where G ∗ denotes the dual graph. We examine this property from the perspective of manifold topology, formulating polynomial invariants for higher-dimensional simplicial complexes. Polynomial duality for triangulations of a sphere follows as a consequence of Alexander duality. The main goal of this paper is to introduce and begin the study of a more general 4-variable polynomial for triangulations and handle decompositions of orientable manifolds. Polynomial duality in this case is a consequence of Poincaré duality on manifolds. In dimension 2 these invariants specialize to the well-known polynomial invariants of ribbon graphs defined by B. Bollobás and O. Riordan. Examples and specific evaluations of the polynomials are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A ug 2 01 4 A POLYNOMIAL INVARIANT AND DUALITY FOR TRIANGULATIONS

The Tutte polynomial TG(X,Y ) of a graph G is a classical invariant, important in combinatorics and statistical mechanics. An essential feature of the Tutte polynomial is the duality for planar graphs G , TG(X,Y ) = TG∗(Y,X) where G∗ denotes the dual graph. We examine this property from the perspective of manifold topology, formulating polynomial invariants for higher-dimensional simplicial com...

متن کامل

Nonregular Triangulations, View Graphs of Triangulations, and Linear Programming Duality

For a triangulation and a point, we de ne a directed graph representing the order of the maximal dimensional simplices in the triangulation viewed from the point. We prove that triangulations having a cycle the reverse of which is not a cycle in this graph viewed from some point are forming a (proper) subclass of nonregular triangulations. We use linear programming duality to investigate furthe...

متن کامل

Some New Results On the Hosoya Polynomial of Graph Operations

The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...

متن کامل

Computation of polytopic invariants for polynomial dynamical systems using linear programming

This paper deals with the computation of polytopic invariant sets for polynomial dynamical systems. An invariant set of a dynamical system is a subset of the state space such that if the state of the system belongs to the set at a given instant, it will remain in the set forever in the future. Polytopic invariants for polynomial systems can be verified by solving a set of optimization problems ...

متن کامل

ar X iv : 0 90 3 . 53 12 v 2 [ m at h . C O ] 1 1 M ay 2 00 9 GRAPHS , LINKS , AND DUALITY ON SURFACES

We introduce a polynomial invariant of graphs on surfaces, PG , generalizing the classical Tutte polynomial. Poincaré duality on surfaces gives rise to a natural duality result for PG , analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statistical mechanics, where Tutte polynomial is known as the partition function of the Pott...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014